#define  _CRT_SECURE_NO_WARNINGS
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size(), n = grid[0].size();
        vector<vector<int>> dp(grid.begin(), grid.end());
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                if (i && j) dp[i][j] += min(dp[i - 1][j], dp[i][j - 1]);
                else if (i) dp[i][j] += dp[i - 1][j];
                else if (j) dp[i][j] += dp[i][j - 1];
        return dp[m - 1][n - 1];
    }
};